A novel embedding technique for dirty paper trellis codes watermarking
نویسنده
چکیده
→ Security weakness (Kerckhoffs's framework). Code book estimable on a simplified version [2]. → High computational complexity of the Embedding part Lin et al. [3] solution is not enough satisfying in term of robustness-distortion tradeoff. → DCT artifacts. [1] “Applying Informed Coding and Informed Embedding to Design a Robust, High Capacity Watermark”, Miller, Doërr, and Cox, IEEE TIP 2004. [2] “Evaluation of an Optimal Watermark Tampering Attack Against Dirty Paper Trellis Schemes”, Bas and Doërr, MM&Sec'2008. [3] “An Efficient Algorithm for Informed Embedding of Dirty Paper Trellis Codes for Watermarking”, Lin, Cox, Doërr, and Miller, ICIP'2005. [4] “Fast Embedding Technique For Dirty Paper Trellis Watermarking”, Chaumont, IWDW’2009. [5] “Broken Arrows”, Furon and Bas, EURASIP Journal on Information Security, 2008. [6] “Psychovisual Rotation-based DPTC Watermarking Scheme”, Chaumont, EUSIPCO’2009. The original DPTC algorithm [1]:
منابع مشابه
Fast Embedding Technique for Dirty Paper Trellis Watermarking
This paper deals with the improvement of the Dirty Paper Trellis Code (DPTC) watermarking algorithm. This watermarking algorithm is known to be one of the best among the high rate watermarking schemes. Nevertheless, recent researches reveal its security weakness. Previously, we proposed to reinforce its security by using a secret space before the embedding. This secret space requires to compute...
متن کاملA Modified Dirty Paper Trellis Codes for Digital Watermarking
Watermark algorithm relies on informed coding which is the scheme of representing of watermark message with patterns that dependents on the host. It offers a large number of alternative vectors to represent the same message. And the feature is trade-off between the robustness and fidelity. The paper describes a modified trellis to embed our data, instead of complex trellis, to reduce the comput...
متن کاملTrellis coded modulation to improve dirty paper trellis watermarking
Lattice codes and quantization-based techniques have received considerable attention as a method of digital watermarking with side information. However, these algorithms are also recognized to be highly sensitive to common signal processing primitives such as valuemetric scaling, e.g. changes in volume of a song, or re-quantization, e.g. JPEG compression. Hence, it is reasonable to investigate ...
متن کاملRobust Audio Watermarks in Frequency Domain
In this paper an audio watermarking technique is presented, using log-spectrum, dirty paper codes and LDPC for watermark embedding. This technique may be used as a digital communication channel, transmitting data at about 40 b/s. It may be also applied for hiding a digital signature, e.g., for copyright protection purposes. Robustness of the watermarks against audio signal compression, resampli...
متن کاملRotation Based Acceleration of Informed Embedding in DPTC Watermarking Scheme
The Dirty Paper Trellis Code (DPTC) watermarking scheme [1] is a very efficient high rate scheme. It has however a major drawback: its computational complexity. This problem is addressed by using a faster embedding technique. The embedding space is built by projecting some wavelet coefficients onto secret carriers. The fast embedding is achieved with a dichotomous rotation in the Cox, Miller, a...
متن کامل